%------------------------------------------------------------------------------
% File     : Satallax---3.5
% Problem  : NUM800^1 : TPTP v8.1.0. Released v3.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s

% Computer : n021.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 600s
% DateTime : Mon Jul 18 13:56:47 EDT 2022

% Result   : Theorem 208.19s 208.31s
% Output   : Proof 208.19s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
thf(sP1,plain,
    ( sP1
  <=> ( ( ^ [X1: $i > $i,X2: $i] : ( X1 @ ( X1 @ ( X1 @ ( X1 @ ( X1 @ ( X1 @ X2 ) ) ) ) ) ) )
      = ( ^ [X1: $i > $i,X2: $i] : ( X1 @ ( X1 @ ( X1 @ ( X1 @ ( X1 @ ( X1 @ X2 ) ) ) ) ) ) ) ) ),
    introduced(definition,[new_symbols(definition,[sP1])]) ).

thf(sP2,plain,
    ( sP2
  <=> ( ( ^ [X1: $i > $i,X2: $i] : ( X1 @ ( X1 @ X2 ) ) )
      = ( ^ [X1: $i > $i,X2: $i] : ( X1 @ ( X1 @ X2 ) ) ) ) ),
    introduced(definition,[new_symbols(definition,[sP2])]) ).

thf(sP3,plain,
    ( sP3
  <=> ( sP1
     => ~ sP2 ) ),
    introduced(definition,[new_symbols(definition,[sP3])]) ).

thf(sP4,plain,
    ( sP4
  <=> ! [X1: ( ( $i > $i ) > $i > $i ) > ( ( $i > $i ) > $i > $i ) > ( $i > $i ) > $i > $i] :
        ( ( ( X1
            @ ^ [X2: $i > $i,X3: $i] : ( X2 @ ( X2 @ X3 ) )
            @ ^ [X2: $i > $i,X3: $i] : ( X2 @ ( X2 @ ( X2 @ X3 ) ) ) )
          = ( ^ [X2: $i > $i,X3: $i] : ( X2 @ ( X2 @ ( X2 @ ( X2 @ ( X2 @ ( X2 @ X3 ) ) ) ) ) ) ) )
       => ( ( X1
            @ ^ [X2: $i > $i] : X2
            @ ^ [X2: $i > $i,X3: $i] : ( X2 @ ( X2 @ X3 ) ) )
         != ( ^ [X2: $i > $i,X3: $i] : ( X2 @ ( X2 @ X3 ) ) ) ) ) ),
    introduced(definition,[new_symbols(definition,[sP4])]) ).

thf(def_zero,definition,
    ( zero
    = ( ^ [X1: $i > $i,X2: $i] : X2 ) ) ).

thf(def_one,definition,
    ( one
    = ( ^ [X1: $i > $i] : X1 ) ) ).

thf(def_two,definition,
    ( two
    = ( ^ [X1: $i > $i,X2: $i] : ( X1 @ ( X1 @ X2 ) ) ) ) ).

thf(def_three,definition,
    ( three
    = ( ^ [X1: $i > $i,X2: $i] : ( X1 @ ( X1 @ ( X1 @ X2 ) ) ) ) ) ).

thf(def_four,definition,
    ( four
    = ( ^ [X1: $i > $i,X2: $i] : ( X1 @ ( X1 @ ( X1 @ ( X1 @ X2 ) ) ) ) ) ) ).

thf(def_five,definition,
    ( five
    = ( ^ [X1: $i > $i,X2: $i] : ( X1 @ ( X1 @ ( X1 @ ( X1 @ ( X1 @ X2 ) ) ) ) ) ) ) ).

thf(def_six,definition,
    ( six
    = ( ^ [X1: $i > $i,X2: $i] : ( X1 @ ( X1 @ ( X1 @ ( X1 @ ( X1 @ ( X1 @ X2 ) ) ) ) ) ) ) ) ).

thf(def_seven,definition,
    ( seven
    = ( ^ [X1: $i > $i,X2: $i] : ( X1 @ ( X1 @ ( X1 @ ( X1 @ ( X1 @ ( X1 @ ( X1 @ X2 ) ) ) ) ) ) ) ) ) ).

thf(def_eight,definition,
    ( eight
    = ( ^ [X1: $i > $i,X2: $i] : ( X1 @ ( X1 @ ( X1 @ ( X1 @ ( X1 @ ( X1 @ ( X1 @ ( X1 @ X2 ) ) ) ) ) ) ) ) ) ) ).

thf(def_nine,definition,
    ( nine
    = ( ^ [X1: $i > $i,X2: $i] : ( X1 @ ( X1 @ ( X1 @ ( X1 @ ( X1 @ ( X1 @ ( X1 @ ( X1 @ ( X1 @ X2 ) ) ) ) ) ) ) ) ) ) ) ).

thf(def_ten,definition,
    ( ten
    = ( ^ [X1: $i > $i,X2: $i] : ( X1 @ ( X1 @ ( X1 @ ( X1 @ ( X1 @ ( X1 @ ( X1 @ ( X1 @ ( X1 @ ( X1 @ X2 ) ) ) ) ) ) ) ) ) ) ) ) ).

thf(def_succ,definition,
    ( succ
    = ( ^ [X1: ( $i > $i ) > $i > $i,X2: $i > $i,X3: $i] : ( X2 @ ( X1 @ X2 @ X3 ) ) ) ) ).

thf(def_plus,definition,
    ( plus
    = ( ^ [X1: ( $i > $i ) > $i > $i,X2: ( $i > $i ) > $i > $i,X3: $i > $i,X4: $i] : ( X1 @ X3 @ ( X2 @ X3 @ X4 ) ) ) ) ).

thf(def_mult,definition,
    ( mult
    = ( ^ [X1: ( $i > $i ) > $i > $i,X2: ( $i > $i ) > $i > $i,X3: $i > $i] : ( X1 @ ( X2 @ X3 ) ) ) ) ).

thf(thm,conjecture,
    ~ sP4 ).

thf(h0,negated_conjecture,
    sP4,
    inference(assume_negation,[status(cth)],[thm]) ).

thf(1,plain,
    ( ~ sP3
    | ~ sP1
    | ~ sP2 ),
    inference(prop_rule,[status(thm)],]) ).

thf(2,plain,
    ( ~ sP4
    | sP3 ),
    inference(all_rule,[status(thm)],]) ).

thf(3,plain,
    sP1,
    inference(prop_rule,[status(thm)],]) ).

thf(4,plain,
    sP2,
    inference(prop_rule,[status(thm)],]) ).

thf(5,plain,
    $false,
    inference(prop_unsat,[status(thm),assumptions([h0])],[1,2,3,4,h0]) ).

thf(0,theorem,
    ~ sP4,
    inference(contra,[status(thm),contra(discharge,[h0])],[5,h0]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : NUM800^1 : TPTP v8.1.0. Released v3.7.0.
% 0.03/0.12  % Command  : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s
% 0.13/0.33  % Computer : n021.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Wed Jul  6 01:07:33 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 208.19/208.31  % SZS status Theorem
% 208.19/208.31  % Mode: mode492
% 208.19/208.31  % Inferences: 944072
% 208.19/208.31  % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------